Fuzzy logic programs as hypergraphs. Termination results

Graph theory has been a useful tool for logic programming in many aspects. In this paper, we propose an equivalent representation of multi-adjoint programs using hypergraphs, which are generalization classical graphs that allows the use hypergraph programming. Specifically, considered paper to increase level and flexibility different termination results computation least model fuzzy via immediate consequence operator. Consequently, more general versatile can be obtained after finitely iterations, although infinite or with loops aggregators will considered.